A M C M Representation of the Non-dominated Set in Biobjective Combinatorial Optimization Representation of the Non-dominated Set in Biobjective Combinatorial Optimization
نویسندگان
چکیده
This article introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective combinatorial optimization problem with respect to uniformity, coverage and the -indicator. These representation problems are formulated as particular facility location problems with a special location structure, which allows for polynomial-time algorithms in the biobjective case based on the principles of dynamic programming and threshold approaches. In addition, we show that several multiobjective variants of these representation problems are also solvable in polynomial time. Computational results obtained by these approaches on a wide range of randomly generated point sets are presented and discussed.
منابع مشابه
Representation of the non-dominated set in biobjective discrete optimization
This article introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective discrete optimization problem with respect to uniformity, coverage and the -indicator. We consider the representation problem itself as multiobjective, trying to find a good compromise between these quality measures. These representation problems are formulated as parti...
متن کاملOn the Effect of Connectedness for Biobjective Multiple and Long Path Problems
Recently, the property of connectedness has been claimed to give a strong motivation on the design of local search techniques for multiobjective combinatorial optimization. Indeed, when connectedness holds, a basic Pareto local search, initialized with at least one non-dominated solution, allows to identify the efficient set exhaustively. However, this becomes quickly infeasible in practice as ...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملMulti-objective Combinatorial Optimization: Beyond the Biobjective Case
09:30 Tristan Cazenave, Marek Cornu, Daniel Vanderpooten A two-phase meta-heuristic applied to the Multi-objective Traveling Salesman Problem Recently, a number of hybrid meta-heuristics have been successfully applied on different problems like the MO Traveling Salesman Problem (TSP), the MO Multidimensional Knapsack Problem and the MO Flow-shop Scheduling Problem. We present a method providing...
متن کاملChoquet optimal set in biobjective combinatorial optimization
We study in this paper the generation of the Choquet optimal solutions of biobjective combinatorial optimization problems. Choquet optimal solutions are solutions that optimize a Choquet integral. The Choquet integral is used as an aggregation function, presenting di erent parameters, and allowing to take into account the interactions between the objectives. We develop a new property that chara...
متن کامل